A Proof Procedure Using Connection Graphs
نویسندگان
چکیده
منابع مشابه
Completeness of the Connection Graph Proof Procedure for Unit-Refutable Clause Sets
In this paper it is shown that R. Kowalski's connection graph proof procedure /Ko75/ terminates with the empty clause for every unit-refutable clause set, provided an exhaustive search strategy is employed. This result holds for unrestricted tautology deletion, whereas subsumption requires certain precautions. The results are shown for an improved version of the connection graph resolution rule...
متن کاملSubsumption And Connection Graphs
A s u b s u m p t i o n t e s t b a s e d o n t h e p r i n c i p a l i d e a o f K o w a l s k i ' s c o n n e c t i o n g r a p h p r o o f p r o c e d u r e i s d e v e l o p e d . I n c o n t r a s t t o t h e s t a n d a r d t e s t t h i s new t e s t i s s u f f i c i e n t l y e f f i c i e n t t o p e r m i t t h e u n r e s t r i c t e d use o f t h e s u b s u m p t i o n r u l e i n...
متن کاملA Proof Procedure for the Logic ofHereditary
A proof procedure is presented for a class of formulas in intuitionistic logic. These formulas are the so-called goal formulas in the theory of hereditary Harrop formulas. Proof search in intuitionistic logic is complicated by the non-existence of a Herbrand-like theorem for this logic: formulas cannot in general be preprocessed into a form such as the clausal form and the construction of a pro...
متن کاملA proof procedure for adaptive logics
In this paper I present a procedure that generates adaptive proofs for finally derivable adaptive logic consequences. The proof procedure for the inconsistency adaptive logic CLuNr is already presented in [10]. In this paper the procedure for CLuNm is presented and the results for both logics are generalized to all adaptive logics, on the presupposition that there exists a total proof procedure...
متن کاملProper connection of graphs
An edge-colored graph G is k-proper connected if every pair of vertices is connected by k internally pairwise vertex-disjoint proper colored paths. The k-proper connection number of a connected graph G, denoted by pck(G), is the smallest number of colors that are needed to color the edges ofG in order tomake it k-proper connected. In this paperweprove several upper bounds for pck(G). We state s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1975
ISSN: 0004-5411,1557-735X
DOI: 10.1145/321906.321919